Search results for "Compatibility graph"

showing 2 items of 2 documents

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

2016

International audience; We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters.

FOS: Computer and information sciencesCoupled-task scheduling model[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Computer science0211 other engineering and technologies0102 computer and information sciences02 engineering and technologyManagement Science and Operations ResearchComputational Complexity (cs.CC)Topology01 natural sciencesExecution timeTheoretical Computer ScienceComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)021103 operations researchJob shop schedulingPolynomial-time approximation algorithmApproximation algorithmCompatibility graphComplexityIdle timeComputer Science ApplicationsComputer Science - Computational Complexity[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsCompatibility (mechanics)Bipartite graphMinification
researchProduct

Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs

2014

We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility graph $G_c$ is bipartite (star, chain, $\ldots$) In such context, we design some efficient polynomial-time approximation algorithms according to difference parameters of the scheduling problem. When $G_c$ is a $k$-stage bipartite graph, we propose, among other, a $\frac{7}{6}$-approximation algorithm when $k=1$, and a $\frac{13}{9}$-approximation…

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC][ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC][INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]schedulingcoupled-taskscomplexityapproximation algorithmcompatibility graph
researchProduct